74 research outputs found
Multi-Objective and Financial Portfolio Optimization of Carrier-Sense Multiple Access Protocols with Cooperative Diversity
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This paper presents a trade-off design and optimization of a class of wireless carrier-sense multiple access protocols where collision-free transmissions are assisted by the potential cooperative retransmissions of inactive terminals with a correct copy of the original transmission. Terminals are enabled with a decode-and-forward relaying protocol. The analysis is focused on asymmetrical settings, where terminals experience different channel and queuing statistics. This work is based on multi-objective and financial portfolio optimization tools. Each packet transmission is thus regarded not only as a network resource, but also as a financial asset with different values of return and risk (or variance of the return). The objective of this financial optimization is to find the transmission policy that simultaneously maximizes return and minimizes risk in the network. The work is focused on the characterization of the boundaries (envelope) of different types of trade-off performance regions: the conventional throughput region, sum-throughput vs. fairness, sum-throughput vs. power, and return vs. risk regions. Fairness is evaluated by means of the Gini-index, which is a metric commonly used in economics to measure income inequality. Transmit power is directly linked to the global transmission rate. The protocol is shown to outperform non-cooperative solutions under different network conditions that are here discussed
Strategic Contention Resolution in Multiple Channels
We consider the problem of resolving contention in communication networks
with selfish users. In a \textit{contention game} each of identical
players has a single information packet that she wants to transmit using one of
multiple-access channels. To do that, a player chooses a
slotted-time protocol that prescribes the probabilities with which at a given
time-step she will attempt transmission at each channel. If more than one
players try to transmit over the same channel (collision) then no transmission
happens on that channel. Each player tries to minimize her own expected
\textit{latency}, i.e. her expected time until successful transmission, by
choosing her protocol. The natural problem that arises in such a setting is,
given and , to provide the players with a common, anonymous protocol (if
it exists) such that no one would unilaterally deviate from it (equilibrium
protocol).
All previous theoretical results on strategic contention resolution examine
only the case of a single channel and show that the equilibrium protocols
depend on the feedback that the communication system gives to the players. Here
we present multi-channel equilibrium protocols in two main feedback classes,
namely \textit{acknowledgement-based} and \textit{ternary}. In particular, we
provide equilibrium characterizations for more than one channels, and give
specific anonymous, equilibrium protocols with finite and infinite expected
latency. In the equilibrium protocols with infinite expected latency, all
players transmit successfully in optimal time, i.e. , with
probability tending to 1 as .Comment: The results of this work are included in the 11th International
Symposium on Algorithmic Game Theory (SAGT 2018) and the 16th Workshop on
Approximation and Online Algorithms (WAOA 2018
Tradeoff between system profit and user delay/loss in providing near video-on-demand service
In a near video-on-demand (near-VOD) system, requests for a movie arriving in a period of time are grouped (or "batched") together and served with a single multicast stream. In this paper, we consider providing near-VOD services when there is a cost associated with using a network multicast channel. We address the tradeoff between system profit, given by the total pay-per-view collected minus the total channel cost, and user delay or user loss (due to reneging). We first analyze and compare the tradeoff of two traditional "basic" schemes, namely, the window-based schemes in which a maximum user delay can be guaranteed, and the batch-size based scheme in which system profit can be guaranteed. By combining these basic schemes, we present a scheme which can adaptively balance system profit and user delay when the underlying request rate fluctuates. We then consider the case in which delayed users may renege and determine how system profit can be maximized by sizing the batching period given user's reneging behavior. We show that maximizing profit can lead to excessively high user loss rate, especially when the channel cost is high and users are not very patient. Therefore, a shorter suboptimal batching period should be used for this case in reality. We finally introduce schemes which are able to offer high profit or low user loss when the underlying arrival rate fluctuates
Expressnet: A High-Performance Integrated-Services Local Area Network
Expressnet is a local area communication network comprising an inbound channel and an outbound channel to which the stations are connected. Stations transmit on the outbound channel and receive on the inbound channel. The inbound channel is connected to the outbound channel so that all signals transmitted on the outbound channel are duplicated on the inbound channel, thus achieving broadcast communication among the stations. In order to transmit on the bus, the stations utilize a distributed access protocol which achieves a conflict-free round-robin scheduling. This protocol is more efficient than existing round-robin Schemes as the time required to switch control from one active user to the next in a round is minimized (on the order of a carrier detection time), and is independent of the end-to-end network propagation delay. This improvement is particularly significant when the channel data rate is so high, or the end-to-end propagation delay is so large, Or the packet size is so small as to render the end-to-end propagation delay a significant fraction of, or larger than, the transmission time of a packet. Moreover, some features of Expressnet make it particularly suitable for voice applications. In view of integrating voice and data, a simple access protocol is described which meets the bandwidth requirement and maximum packet delay constraint for voice communication at all times, while guaranteeing a minimum bandwidth requirement for data traffic. Finally, it is noted that the voice/data access protocol constitutes a highly adaptive allocation scheme of channel bandwidth, which allows data users to recover the bandwidth unused by the voice application. It can be easily extended to accommodate any number of applications, each with its specific requirements
- …